Grasp Approach to Rcpsp with Min- Max Robustness Objective
نویسندگان
چکیده
This paper deals with the Resource-Constrained Project scheduling Problem (RCPSP) under activity duration uncertainty. Based on scenarios, the object is to minimize the worst-case performance among a set of initial scenarios which is referred to as the min-max robustness objective. Due to the complexity of the tackled problem, we propose the application of the GRASP method which is qualified as a simple and effective multi-start metaheuristic. The proposed approach incorporates an adaptive greedy function based on priority rules to construct new solutions, and a local search with a forward-backward heuristic in the improvement phase. Two different benchmark data sets are investigated, the Patterson set and the PSPLIB J30 set. Comparative results show that the proposed enhanced GRASP outperforms the basic procedure in robustness optimization.
منابع مشابه
Obust O Ptimization for Rcpsp under U Ncertainty
The aim of the present article is to optimize the robustness objective for the Resource-Constrained Project scheduling Problem (RCPSP) dealing with activity duration uncertainty. The studied robustness consists in minimizing the worst-case performance, referred to as the min-max robustness objective, among a set of initial scenarios. We propose an enhanced GRASP approach as a solution to the gi...
متن کاملRobust execution strategies for project scheduling with unreliable resources and stochastic durations
The Resource Constrained Project Scheduling Problem with minimum and maximum time lags (RCPSP/max) is a general model for resource scheduling in many real-world problems (such as manufacturing and construction engineering). We consider RCPSP/max problems where the durations of activities are stochastic and resources can have unforeseen breakdowns. Given a level of allowable risk, α, our mechani...
متن کاملTowards Finding Robust Execution Strategies for RCPSP/max with Durational Uncertainty
Resource Constrained Project Scheduling Problems with minimum and maximum time lags (RCPSP/max) have been studied extensively in the literature. However, the more realistic RCPSP/max problems – ones where durations of activities are not known with certainty – have received scant interest and hence are the main focus of the paper. Towards addressing the significant computational complexity invol...
متن کاملUsing Artificial Bee Colony to Solve Stochastic Resource Constrained Project Scheduling Problem
Resource constrained project scheduling (RCPSP) is one of the most crucial problems in project problem. The aim of RCPSP, which is NP-hard, is to minimize the project duration. Sometimes the activity durations are not known in advance and are random variables. These problems are called stochastic resource constrained project scheduling problems or stochastic RCPSP. Various algorithms such as ge...
متن کاملRobust Partial Order Schedules for RCPSP/max with Durational Uncertainty
In this work, we consider RCPSP/max with durational uncertainty. We focus on computing robust Partial Order Schedules (or, in short POS) which can be executed with risk controlled feasibility and optimality, i.e., there is stochastic posteriori quality guarantee that the derived POS can be executed with all constraints honored and completion before robust makespan. To address this problem, we p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2016